From Duration Calculus To Linear Hybrid Automata
نویسندگان
چکیده
We relate two diierent approaches for the speciication and veriication of hybrid systems. The rst one is logic-based and uses the framework of the Calculus of Durations (CoD), the second one is automata-based and uses algorithmic analysis techniques for hybrid automata. Fragments of CoD have been identiied in 13, 19] for the description of control systems and their requirements. We mainly show that the problem of verifying that a CoD control design satisses a CoD requirement is decidable. This is proved by reducing this veriication problem to the reachability problem for a subclass of linear hybrid automata where this problem is decidable.
منابع مشابه
Checking Hybrid Automata for Linear Duration Invariants
In this paper, we consider the problem of checking hybrid systems modelled by hybrid automata for a class of real-time properties represented by linear duration invariants, which are constructed from linear inequalities of integrated durations of system states. Based on linear programming, an algorithm is developed for solving the problem for a class of hybrid automata.
متن کاملOn the Design of Hybrid Control Systems Using Automata Models
The paper gives a systematic way for the development of hybrid control systems, i.e. to reene speciications written in DC (Duration Calculus) into automata models. Firstly, DC formulas are extended with iteration form and a technique for deriving plant automata from DC formulas is presented. Then, a speciication of control automata can be synthesized from plant automata with respect to requirem...
متن کاملInterval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time constraints is presented. As our main result, we show that the models of an LIDL formula can be capt...
متن کاملChecking Linear Duration Invariants by Linear Programming
In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants 2] is addressed. We show that by linear programming, a particular class of timed automata including the class of real-time automata as a proper subset, can be checked for linear duration invariants. The so-called real-time regular expressions is introduced to expre...
متن کاملOn Checking Timed Automata for Linear Duration Invariants
In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to translate Timed Automata to a sort of regular expressions for timed languages. Then, we extend the li...
متن کامل